A short report on:∗ Pinocchio: Nearly Practical Verifiable Computation

In this report, we aim to present a short description on the Pinocchio which is an efficient solution for Verifiable Computations (VC) and presented by Parno, Howell, Gentry, and Raykova in 2013 IEEE Symposium on Security and Privacy [PHGR13]. In fact, Pinocchio is a practical implementation of SNARKs (Succinct non-interactive argument of knowledge) which are systems that allow a client to ask a server or cloud to compute F (x) for a given function F and an input x and then verify the correctness of the returned result in considerably less time than it would take to compute F from scratch; this property is also known as VC. In addition, Pinocchio supports zeroknowledge property, in which the server convinces the client that it knows an input with a particular property, without revealing any information about the input. Pinocchio takes a high-level C program and compiles it to a low-level logic circuit and then encodes the logic circuit to a quadratic program; And after that, it compiles the quadratic program to a cryptographic verification protocol. In this report, we mainly focus on encoding a logic circuit to a quadratic program and compiling it to a cryptographic verification protocol, which consists in systems-level improvements and brings time down 5-7 order of magnitude, which will be discussed in 7 practical applications.